翻訳と辞書
Words near each other
・ Towers Corners, New York
・ Towers Department Stores
・ Towers Hall
・ Towers High School
・ Towers Historic District
・ Towers in the park
・ Towers Karpoš IV Tower I
・ Towers Karpoš IV Tower II
・ Towers Karpoš IV Tower III
・ Towers of America
・ Tower of Glass
・ Tower of God
・ Tower of Gourze
・ Tower of Guns
・ Tower of Hallbar
Tower of Hanoi
・ Tower of Hanoy
・ Tower of Heaven
・ Tower of Hercules
・ Tower of Iglesia de San Salvador
・ Tower of Jericho
・ Tower of Jewels
・ Tower of jewels
・ Tower of Jewels (PPIE)
・ Tower of Kamyenyets
・ Tower of Kurt Pasha
・ Tower of Light
・ Tower of Llanes
・ Tower of London
・ Tower of London (1939 film)


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Tower of Hanoi : ウィキペディア英語版
Tower of Hanoi

The Tower of Hanoi (also called the Tower of Brahma or Lucas' Tower, and sometimes pluralized) is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape.
The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:
# Only one disk can be moved at a time.
# Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack i.e. a disk can only be moved if it is the uppermost disk on a stack.
# No disk may be placed on top of a smaller disk.
With three disks, the puzzle can be solved in seven moves. The minimum number of moves required to solve a Tower of Hanoi puzzle is 2''n'' - 1, where ''n'' is the number of disks.
== Origins ==

The puzzle was invented by the French mathematician Édouard Lucas in 1883. There is a story about an Indian temple in Kashi Vishwanath which contains a large room with three time-worn posts in it surrounded by 64 golden disks. Brahmin priests, acting out the command of an ancient prophecy, have been moving these disks, in accordance with the immutable rules of the Brahma, since that time. The puzzle is therefore also known as the Tower of Brahma puzzle. According to the legend, when the last move of the puzzle will be completed, the world will end. It is not clear whether Lucas invented this legend or was inspired by it.
If the legend were true, and if the priests were able to move disks at a rate of one per second, using the smallest number of moves, it would take them 264−1 seconds or roughly 585 billion years or 18,446,744,073,709,551,615 turns to finish, or about 127 times the current age of the sun.
There are many variations on this legend. For instance, in some tellings, the temple is a monastery and the priests are monks. The temple or monastery may be said to be in different parts of the world — including Hanoi, Vietnam, and may be associated with any religion. In some versions, other elements are introduced, such as the fact that the tower was created at the beginning of the world, or that the priests or monks may make only one move per day.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Tower of Hanoi」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.